06. Tree Search Continued

INSTRUCTOR NOTE:

In the video from 1:55 onward, we are looking ahead to a modified algorithm that keeps track of explored states so that they aren't repeated. In the preliminary algorithm, A is repeated since we are not keeping track of explored states. Ideally, we would not add duplicates from backtracking, which we introduce in the following video.